Universal Recursively Enumerable Sets of Strings
نویسندگان
چکیده
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the spectrum function sW (n) mapping n to the number of all strings of length n in the set W . An r.e. prefix-free set W is the superset of the domain of a universal machine iff there are two constants c, d such that sW (n) + sW (n + 1) + . . . + sW (n + c) is between 2n−H(n)−d and 2n−H(n)+d for all n; W is the domain of a universal machine iff there is a constant c such that for each n the pair of n and sW (n) + sW (n + 1) + . . . + sW (n + c) has at least the prefix-free description complexity n. There exists a prefix-free r.e. superset W of a domain of a universal machine which is the not a domain of a universal machine; still, the halting probability ΩW of such a set W is Martin-Löf random. Furthermore, it is investigated to which extend this results can be transferred to plain universal machines.
منابع مشابه
DNA Computing Based on Splicing : Universality
The paper extends some of the most recently obtained results on the computational universality of speciic variants of H systems (e. g. with regular sets of rules) and proves that we can construct universal computers based on various types of H systems with a nite set of splicing rules as well as a nite set of axioms, i. e. we show the theoretical possibility to design programmable universal DNA...
متن کاملRandomness and Recursive Enumerability
One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[i] : i ∈ ω) approximating α and (b[i] : i ∈ ω) approximating β and a positive constant C such that for all n, C(α−a[n]) ≥ (β−b[n]). See [Solovay, 1975] and [Chaitin, 1977]. We show every recursively enumerable random real dominates all other recursively enumerable real...
متن کاملCharacterizing Languages by Normalization and Termination in String Rewriting
We characterize sets of strings using two central properties from rewriting: normalization and termination. We recall the well-known result that any recursively enumerable set of strings can occur as the set of normalizing strings over a “small” alphabet if the rewriting system is allowed access to a “larger” alphabet (and extend the result to termination). We then show that these results do no...
متن کاملCharacterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract)
We characterize sets of strings using two central properties from rewriting: normalization and termination. We recall the well-known result that any recursively enumerable set of strings can occur as the set of normalizing strings over a “small” alphabet if the rewriting system is allowed access to a “larger” alphabet (and extend the result to termination). We then show that these results do no...
متن کاملCiliate Operations without Context in a Membrane Computing Framework
We study the computational power of string processing systems with excision and insertion rules with communication. The strings are distributed in different regions, and the rules are defined by cutting out a substring flanked by specific repeated symbols and a reverse operation; the rule only specifies the repeated symbol and the regions of reactants and products. It turns out that they can ge...
متن کامل